A Tableau Calculus for Equilibrium Entailment
نویسندگان
چکیده
We apply tableau methods to the problem of computing entailment in the nonmonotonic system of equilibrium logic, a generalisation of the inference relation associated with the stable model and answer set semantics for logic programs. We describe tableau calculi for the nonclassical logics underyling equilibrium entailment, namely hereand-there with strong negation and its strengthening classical logic with strong negation. A further tableau calculus is then presented for computing equilibrium entailment. This makes use of a new method for reducing the complexity of the tableau expansion rules, which we call signing-up.
منابع مشابه
ar X iv : 1 40 5 . 15 65 v 1 [ cs . L O ] 7 M ay 2 01 4 Tableau vs . Sequent Calculi for Minimal Entailment
In this paper we compare two proof systems for minimal entailment: a tableau system OTAB and a sequent calculus MLK , both developed by Olivetti (1992). Our main result shows that OTAB-proofs can be efficiently translated into MLK -proofs, i.e.,MLK psimulates OTAB . The simulation is technically very involved and answers an open question posed by Olivetti (1992) on the relation between the two ...
متن کاملTableau vs. Sequent Calculi for Minimal Entailment
In this paper we compare two proof systems for minimal entailment: a tableau system OTAB and a sequent calculus MLK , both developed by Olivetti (1992). Our main result shows that OTAB-proofs can be efficiently translated into MLK -proofs, i.e.,MLK psimulates OTAB . The simulation is technically very involved and answers an open question posed by Olivetti (1992) on the relation between the two ...
متن کاملA Tableau Calculus for a Nonmonotonic Extension of EL^\mathcal{EL}^\bot
We introduce a tableau calculus for a nonmonotonic extension of low complexity Description Logic EL that can be used to reason about typicality and defeasible properties. The calculus deals with Left Local knowledge bases in the logic EL⊥Tmin recently introduced in [8] . The calculus performs a twophase computation to check whether a query is minimally entailed from the initial knowledge base. ...
متن کاملA tableau calculus for a nonmonotonic extension of the Description Logic DL-Litecore
In this paper we introduce a tableau calculus for a nonmonotonic extension of the low complexity Description Logic DL-Litecore of the DL-Lite family. The extension, called DL-LitecTmin, can be used to reason about typicality and defeasible properties. The calculus performs a two-phase computation to check whether a query is minimally entailed from the initial knowledge base. It is sound, comple...
متن کاملA Calculus for Interrogatives Based on Their Algebraic Semantics
We present a novel calculus for reasoning with both indicative and interrogative sentences, simultaneously modeling entailment between indicative sentences, entailment between interrogative sentences and answerhood relations. The logic is based on an interpretation of questions as entities of type t, the type of propositions. This is achieved by an algebraic reinterpretation of the domain of ty...
متن کامل